Everything Totally Explained


Ask & we'll explain, totally!
Context-free language
Totally Explained


  NEW! All the latest news in the worlds of computer gaming, entertainment, the environment,  
finance, health, politics, science, stocks & shares, technology and much, much, more.  


View this entry using RSS

Everything about Context-free Language totally explained

A context-free language is a formal language that can be defined by a context-free grammar. The set of all context-free languages is identical to the set of languages accepted by pushdown automata.

Examples

An archetypical context-free language is L = , which can be shown to be non-context-free by the pumping lemma for context-free languages.

Decidability properties

The following problems for context-free languages are undecidable:
  • Equivalence: given two context-free grammars A and B, is L(A)=L(B)?
  • is L(A) cap L(B) = emptyset ?
  • is L(A)=Sigma^* ?
  • is L(A) subseteq L(B) ? The following problems are decidable for context-free languages:
  • is L(A)=emptyset ?
  • is L(A) finite?
  • Membership: given any word w, does w in L(A) ? (membership problem is even polynomially decidable - see CYK algorithm)

    Properties of context-free languages

  • The reverse of a context-free language is context-free, but the complement need not be.
  • Every regular language is context-free because it can be described by a regular grammar.
  • The intersection of a context-free language and a regular language is always context-free.
  • There exist context-sensitive languages which are not context-free.
  • To prove that a given language isn't context-free, one may employ the pumping lemma for context-free languages.Further Information

    Get more info on 'Context-free Language'.


    External Link Exchanges

    Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:

      <a href="http://context-free_language.totallyexplained.com">Context-free language Totally Explained</a>

    Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
       As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned.



  • Copyright © 2007-8 totallyexplained.com | Licensed under the GNU Free Documentation License | Site Map
    This article contains text from the Wikipedia article Context-free language (History) and is released under the GFDL | RSS Version